Path planning of 3-D objects using a new workspace model

نویسندگان

  • Chi-Hao Tsai
  • Jou-Sin Lee
  • Jen-Hui Chuang
چکیده

This paper proposes a collision avoidance algorithm to solve the problem of (local) path planning for a three-dimensional (3-D) object moving among polyhedral obstacles. The algorithm is based on a generalized potential model of workspace [1] which assumes that the boundary of every 3-D object is uniformly charged. According to the proposed approach, the repulsive force and torque between the moving object and the obstacles due to the above model is used to adjust the position and orientation of the object so as to keep it away from the obstacles while passing through a bottleneck in the free space. Simulation results demonstrate that the path of a 3-D object thus obtained is indeed safe and spatially smooth. The adopted potential field is analytically tractable which makes the path planning efficient.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Potential-Based Modeling of 2D Regions Using Non-uniform Source Distributions

One of existing approaches to path planning problems uses a potential function to represent the topological structure of the free space. Newtonian potential was used in [1] to represent object and obstacles in the two-dimensional (2-D) workspace wherein their boundaries are assumed to be uniformly charged. In this paper, more general, nonuniform distributions are considered. It is shown that fo...

متن کامل

مسیریابی روبات متحرک با استفاده از روشی جدید مبتنی بر الگوریتم ژنتیک با طول آرایه متغیر

  Being one of the major research fields in the robotics discipline, the robot motion planning problem deals with finding an obstacle-free start-to-goal path for a robot navigating among workspace obstacles. Such a problem is also encountered in path planning of intelligent vehicles and Automatic Guided Vehicles (AGVs). Traditional (exact) algorithms have failed to solve the problem effectively...

متن کامل

A Pareto Optimal D* Search Algorithm for Multiobjective Path Planning

Path planning is one of the most vital elements of mobile robotics, providing the agent with a collision-free route through the workspace. The global path plan can be calculated with a variety of informed search algorithms, most notably the A* search method, guaranteed to deliver a complete and optimal solution that minimizes the path cost. D* is widely used for its dynamic replanning capabilit...

متن کامل

Path Planning with a Lazy Significant Edge Algorithm (LSEA)

Probabilistic methods have been proven to be effective for robotic path planning in a geometrically complex environment. In this paper, we propose a novel approach, which utilizes a specialized roadmap expansion phase, to improve lazy probabilistic path planning. This expansion phase analyses roadmap connectivity information to bias sampling towards objects in the workspace that have not yet be...

متن کامل

Potential-based path planning for robot manipulators

In this paper, a potential-based path-planning algorithm for a high DOF robot manipulator is proposed. Unlike some c-space-based approaches, which often require expensive preprocessing for the construction of the c-space, the proposed approach uses the workspace information directly. The approach computes, similar to that done in electrostatics, repulsive force and torque between objects in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Systems, Man, and Cybernetics, Part C

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2001